Matrix Factorizations in Fixed Point on the C 6 xVLIW

نویسندگان

  • ArchitectureGene Golub
  • Ian Mitchell
چکیده

1 Summary We investigated matrix factorization in three applications: mimimum mean square error decision feedback equalization (which uses a special form of the Cholesky factorization), code division multiple access (which uses a traditional form of the Cholesky factorization) and blind equalization (which uses the singular value decomposition). The MMSE-DFE application's factorization was both faster and more stable numerically; therefore, we focussed on analyzing and developing this algorithm for TI's C6x DSP. In the MMSE-DFE, the Cholesky factorization of a matrix R is used to compute the feedforward and feedback tap coeecients of the equalizer. Matrix R has the property of displacement structure, and so a special algorithm (attributed to Schur) can be used. This algorithm works on a generating matrix G whose size is much smaller than R, and G can be constructed from easily estimated channel properties. Once the Cholesky factor L of R is computed from G, the tap coeecients can be extracted by a simple backward substitution procedure. Unlike traditional Cholesky factorization, the Schur algorithm uses orthogonal operations to eliminate nonzeros in the matrix. Orthogonal operations are inherently stable numerically; in addition, the G of MMSE-DFE is very well behaved for a generating matrix. The combination of these eeects keeps numerical error in the lowest few bits, even in a xed point implementation. Example runs indicate that the error introduced by xed point computation is insigniicant. The Schur algorithm has two key procedures at each step: nd the orthogonal operation to eliminate nonzeros, and then apply it to the remaining portions of G. The latter operation is very well suited to the C6x's parallel computation units and runs very eeciently. The former operation is poorly suited|it is iterative in nature and requires sequential operations and conditional branching. For channels with short memory the iterative operation can have signiicant

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Fixed Point Theorems in Generalized Metric Spaces Endowed with Vector-valued Metrics and Application in Linear and Nonlinear Matrix Equations

Let $mathcal{X}$ be a partially ordered set and $d$ be a generalized metric on $mathcal{X}$. We obtain some results in coupled and coupled coincidence of $g$-monotone functions on $mathcal{X}$, where $g$ is a function from $mathcal{X}$ into itself. Moreover, we show that a nonexpansive mapping on a partially ordered Hilbert space has a fixed point lying in  the unit ball of  the Hilbert space. ...

متن کامل

Fixed point theorems on generalized $c$-distance in ordered cone $b$-metric spaces

In this paper, we introduce a concept of a generalized $c$-distance in ordered cone $b$-metric spaces and, by using the concept, we prove some fixed point theorems in ordered cone $b$-metric spaces. Our results generalize the corresponding results obtained by Y. J. Cho, R. Saadati, Shenghua Wang (Y. J. Cho, R. Saadati, Shenghua Wang, Common fixed point  heorems on generalized distance in ordere...

متن کامل

Riordan group approaches in matrix factorizations

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

متن کامل

Fixed point theorems under c-distance in ordered cone metric space

Recently, Cho et al. [Y. J. Cho, R. Saadati, S. H. Wang, Common xed point theorems on generalized distance in ordered cone metric spaces, Comput. Math. Appl. 61 (2011) 1254-1260] dened the concept of the c-distance in a cone metric space and proved some xed point theorems on c-distance. In this paper, we prove some new xed point and common xed point theorems by using the distance in ordered con...

متن کامل

Spatial operator factorization and inversion of the manipulator mass matrix

’bo new recursive factorizations are developed of the mass matrix for fixed-base and mobile-base manipulators. First, the mass matrix M is shown to have the factorization M = H$M$* H’. This is referred to here as the Newton-Euler factorization because it is closely related to the recursive Newton-Euler equations of motion. This factorization may be the simplest way to show the equivalence of re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998